Using Graph Edit Distance to Diagnose Student's Science Process Skill in Physics

نویسندگان

  • Ming-Xiang Fan
  • Maiga Chang
  • Rita Kuo
  • Jia-Sheng Heh
چکیده

Science process skill is important to students when they are learning sciences. We have built a story-based virtual experiment environment in Physics to train student’s science process skills. However, the teacher currently doesn’t know how the students’ science process skills are while they are using the virtual experiment environment. For this reason, this research tries to apply the graph edit distances to design the graph-based diagnosis methodology and uses the methodology to compare the student’s science process skill graph and the expected graph in order to give both the teacher and the student feedback regarding the student’s science process skills. This research also proposes the experiment design and plans to do the experiment in the end of this May (May, 2010) to prove the effectiveness of the proposed graph-based diagnosis methodology in analyzing students’ science process skills in Physics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixing Deadlocking Service Choreographies Using a Simulation-based Graph Edit Distance

Many work has been conducted to analyze services and service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defective services is usually done manually. This paper introduces a graph-based approach to calculate the minimal edit distance between a given defective service and synthesized correct services. This edit distance he...

متن کامل

NED: An Inter-Graph Node Metric Based On Edit Distance

Node similarity is a fundamental problem in graph analytics. However, node similarity between nodes in different graphs (inter-graph nodes) has not received a lot of attention yet. The inter-graph node similarity is important in learning a new graph based on the knowledge of an existing graph (transfer learning on graphs) and has applications in biological, communication, and social networks. I...

متن کامل

Automatic learning of cost functions for graph edit distance

Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarity of attributed graphs in an error-tolerant way. The key idea is to model graph variations by structural distortion operations. As one of its main constraints, however, the edit distance requires the adequate definitio...

متن کامل

Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance

Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defective services is usually done manually. This paper introduces a graph-based approach to calculate the minimal edit distance between a given defective service and synthesized correct services. This edit distance helps to automa...

متن کامل

The maximum edit distance from hereditary graph properties

For a graph property P, the edit distance of a graph G from P, denoted EP(G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying P. What is the largest possible edit distance of a graph on n vertices from P? Denote this distance by ed(n,P). A graph property is hereditary if it is closed under removal of vertic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010